Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers
نویسندگان
چکیده
We compute the sharp thresholds on g at which g-large and g-regressive Ramsey numbers cease to be primitive recursive and become Ackermannian. We also identify the threshold below which g-regressive colorings have usual Ramsey numbers, that is, admit homogeneous, rather than just min-homogeneous sets.
منابع مشابه
The Threshold for Ackermannian Ramsey Numbers
For a function g : N → N, the g-regressive Ramsey number of k is the least N so that N min −→ (k)g. This symbol means: for every c : [N ] → N that satisfies c(m, n) ≤ g(min{m, n}) there is a min-homogeneous H ⊆ N of size k, that is, the color c(m, n) of a pair {m, n} ⊆ H depends only on min{m, n}. It is known ([4, 5]) that Id-regressive Ramsey numbers grow in k as fast as Ack(k), Ackermann’s fu...
متن کاملClassifying the phase transition threshold for unordered regressive Ramsey numbers
Following ideas of Richer (2000) we introduce the notion of unordered regressive Ramsey numbers or unordered Kanamori-McAloon numbers. We show that these are of Ackermannian growth rate. For a given number-theoretic function f we consider unordered f -regressive Ramsey numbers and classify exactly the threshold for f which gives rise to the Ackermannian growth rate of the induced unordered f -r...
متن کاملClassifying the phase transition threshold for Ackermannian functions
It is well known that the Ackermann function can be defined via diagonalization from an iteration hierarchy (of Grzegorczyk type) which is built on a start function like the successor function. In this paper we study for a given start function g iteration hierarchies with a sublinear modulus h of iteration. In terms of g and h we classify the phase transition for the resulting diagonal function...
متن کاملPhase Transition Thresholds for Some Natural Subclasses of the Computable Functions
In this paper we first survey recent advances on phase transition phenomena which are related to natural subclasses of the recursive functions. Special emphasis is put on descent recursive functions, witness bounding functions for well-partial orders and Ramsey functions. In the last section we prove in addition some results which show how the asymptotic of the standard Ramsey function is affec...
متن کاملSharp Phase Transition Thresholds for the Paris Harrington Ramsey Numbers for a Fixed Dimension
This article is concerned with investigations on a phase transition which is related to the (finite) Ramsey theorem and the Paris-Harrington theorem. For a given number-theoretic function g, let Rd c (g)(k) be the least natural number R such that for all colourings P of the d-element subsets of {0, . . . , R− 1} with at most c colours there exists a subset H of {0, . . . , R− 1} such that P has...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 115 شماره
صفحات -
تاریخ انتشار 2008